Evasive subspaces

نویسندگان

چکیده

Let V denote an r-dimensional vector space over F q n , the finite field of elements. Then is also r n-dimension . An -subspace U ( h k ) -evasive if it meets h-dimensional -subspaces in dimension at most k. The 1 subspaces are known as scattered and they have been intensively studied geometry, their maximum size has proved to be ? ? 2 ? when even or = 3. We investigate subspaces, study two duality relations among them provide various constructions. In particular, we present first examples, for infinitely many values q, 3 5. obtain these examples characteristics 2,

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Obfuscation for Evasive Functions

An evasive circuit family is a collection of circuits C such that for every input x, a random circuit from C outputs 0 on x with overwhelming probability. We provide a combination of definitional, constructive, and impossibility results regarding obfuscation for evasive functions: 1. The (average case variants of the) notions of virtual black box obfuscation (Barak et al, CRYPTO ’01) and virtua...

متن کامل

Sparse and Evasive Pseudorandom Distributions

Pseudorandom distributions on n -bit strings are ones which cannot be efficiently distinguished from the uniform distribution on strings of the same length. Namely, the expected behavior of any polynomial-time algorithm on a pseudorandom input is (almost) the same as on a random (Le. unifo~y chosen) input. Clearly, the uniform distribution is a pseudorandom one. But do such trivial cases exhaus...

متن کامل

Gregarious behaviour of evasive prey.

Gregarious behavior of potential prey was explained by Hamilton (1971) on the basis of risk-sharing: The probability of being picked up by a predator is small when one makes part of a large aggregate of prey. This argument holds only if the predator chooses its victims at random. It is not the case for herds of evasive prey in the open, where prey's gregarious behavior, favorable for the fast g...

متن کامل

Covering of subspaces by subspaces

Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph Gq(n, r) by subspaces from the Grassmann graph Gq(n, k), k ≥ r , are discussed. The problem is of interest from four points of view: coding theory, combinatorial designs, q-analogs, and projective geometry. In particular we examine coverings based on lifted maximum rank distance codes, combined with spreads and...

متن کامل

Survival of an evasive prey.

We study the survival of a prey that is hunted by N predators. The predators perform independent random walks on a square lattice with V sites and start a direct chase whenever the prey appears within their sighting range. The prey is caught when a predator jumps to the site occupied by the prey. We analyze the efficacy of a lazy, minimal-effort evasion strategy according to which the prey trie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Designs

سال: 2021

ISSN: ['1520-6610', '1063-8539']

DOI: https://doi.org/10.1002/jcd.21783